Integers for the Number of Maximal Independent Sets in Graphs
نویسندگان
چکیده
Let G be a simple undirected graph. Denote by mi(G) (respectively, xi(G)) the number of maximal (respectively, maximum) independent sets in G. In this paper we determine the third and fouth largest value of mi(G) among all graphs of order n. Moreover, the extremal graphs achieving these values are also determined. Mathematics Subject Classification: 05C35, 05C69, 68R10
منابع مشابه
Global Forcing Number for Maximal Matchings under Graph Operations
Let $S= \{e_1,\,e_2, \ldots,\,e_m\}$ be an ordered subset of edges of a connected graph $G$. The edge $S$-representation of an edge set $M\subseteq E(G)$ with respect to $S$ is the vector $r_e(M|S) = (d_1,\,d_2,\ldots,\,d_m)$, where $d_i=1$ if $e_i\in M$ and $d_i=0$ otherwise, for each $i\in\{1,\ldots , k\}$. We say $S$ is a global forcing set for maximal matchings of $G$ if $...
متن کاملDifferent-Distance Sets in a Graph
A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...
متن کاملINDEPENDENT SETS OF SOME GRAPHS ASSOCIATED TO COMMUTATIVE RINGS
Let $G=(V,E)$ be a simple graph. A set $Ssubseteq V$ isindependent set of $G$, if no two vertices of $S$ are adjacent.The independence number $alpha(G)$ is the size of a maximumindependent set in the graph. In this paper we study and characterize the independent sets ofthe zero-divisor graph $Gamma(R)$ and ideal-based zero-divisor graph $Gamma_I(R)$of a commutative ring $R$.
متن کاملSome Results on the Maximal 2-Rainbow Domination Number in Graphs
A 2-rainbow dominating function ( ) of a graph is a function from the vertex set to the set of all subsets of the set such that for any vertex with the condition is fulfilled, where is the open neighborhood of . A maximal 2-rainbow dominating function on a graph is a 2-rainbow dominating function such that the set is not a dominating set of . The weight of a maximal is the value . ...
متن کاملMaximal Independent Sets for the Pixel Expansion of Graph Access Structure
Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008